Supplementary Materials for ” Fast Matrix - vector Multiplications for Large - scale Logistic Regression on Shared - memory Systems ”
نویسندگان
چکیده
For data sets with many features, ∇f(w) is a huge and dense matrix that is too large to be stored. Machine learning Algorithm 1 CG for approximately solving (A.4) 1) Let s = 0, r = −∇f(w), d = r, and rsq = ‖r‖. 2) For i = 0, 1, . . . • If some stopping conditions hold, stop and output s as s. • Calculate v = ∇f(w)d by (A.5) • α← rsq/dv • s← s+ αd and r ← r − αv. • rnew sq ← ‖r‖ • β ← rnew sq /rsq and rsq ← rnew sq • d← r + βd.
منابع مشابه
A Fast Hybrid Algorithm for Large-Scale l1-Regularized Logistic Regression
l1-regularized logistic regression, also known as sparse logistic regression, is widely used in machine learning, computer vision, data mining, bioinformatics and neural signal processing. The use of l1 regularization attributes attractive properties to the classifier, such as feature selection, robustness to noise, and as a result, classifier generality in the context of supervised learning. W...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملTopics in Large-scale Sparse Estimation and Control
Topics in Large-Scale Sparse Estimation and Control by Tarek Sami Rabbani Doctor of Philosophy in Engineering-Mechanical Engineering and the Designated Emphasis in Computational Science and Engineering University of California, Berkeley Professor Laurent El Ghaoui, Chair In this thesis, we study two topics related to large-scale sparse estimation and control. In the first topic, we describe a m...
متن کاملElectromagnetics Computations Using the MPI Parallel Implementation of the Steepest Descent Fast Multipole Method (SDFMM)
The computational solution of large-scale linear systems of equations necessitates the use of fast algorithms but is also greatly enhanced by employing parallelization techniques. The objective of this work is to demonstrate the speedup achieved by the MPI (Message Passing Interface) parallel implementation of the Steepest Descent Fast Multipole Method (SDFMM). Although this algorithm has alrea...
متن کاملA scalable RBF-FD method for atmospheric flow
Radial basis function-generated finite difference (RBF–FD) methods have recently been proposed as very interesting for global scale geophysical simulations, and have been shown to outperform established pseudo-spectral and discontinuous Galerkin methods for shallow water test problems. In order to be competitive for very large scale simulations, the RBF–FD methods needs to be efficiently implem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016